SIRALINA: efficient two-steps heuristic for storage optimisation in single period task scheduling
نویسندگان
چکیده
منابع مشابه
SIRALINA: efficient two-steps heuristic for storage optimisation in single period task scheduling
In this paper, we study the general problem of one-dimensional periodic task scheduling under storage requirement, irrespective of machine constraints. We have already presented in (Touati and Eisenbeis, 2004) a theoretical framework that allows an optimal optimisation of periodic storage requirement in a cyclic schedule. Since our optimization problem is NP-hard (Touati, 2002), solving an exac...
متن کاملEfficient Task Scheduling Heuristic for Multiprocessor Systems
The problem of assigning and scheduling parallel job tasks onto multiple processing elements is a complex one and has resulted in numerous heuristics aimed at approximating an optimal solution. A heuristic based on the well known list scheduling is proposed here. Dubbed Rule-List Scheduling (RLS), it compares well against other heuristics when using program total completion time as a metric. In...
متن کاملEfficient Heuristic Optimization in Single Machine Scheduling
In this paper, we present a comparison of heuristic optimization algorithms for single machine scheduling problems with and without arbitrary job release times. The main focus of our analysis is the efficiency of the examined methods, i.e. how they perform under strictly limited computation time. Furthermore, we study the effects of arbitrary release times on problem difficulty and required com...
متن کاملAn Efficient Task Clustering Heuristic for Scheduling DAGs on Multiprocessors
For task clustering with no duplication, the DSC algorithm of Gerasoulis and Yang is empirically the best known algorithm to date in terms of both speed and solution quality. The DSC algorithm is based on the critical path method. In this paper, we present an algorithm called CASS-II for task clustering with no duplication which is competitive to DSC in terms of both speed and solution quality....
متن کاملEfficient Method for Periodic Task Scheduling with Storage Requirement Minimization
In this paper, we study an efficient approximate integer linear programming formulation of the general problem of one-dimensional periodic task scheduling under storage requirement, irrespective of machine constraints. We have already presented in [8] a theoretical framework that allows an optimal optimization of periodic storage requirement in a periodic schedule. This problem is used to optim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Optimization
سال: 2010
ISSN: 1382-6905,1573-2886
DOI: 10.1007/s10878-010-9332-8